Arthur-Merlin Streaming Complexity
نویسندگان
چکیده
Article history: Received 31 July 2013 Available online 12 December 2014
منابع مشابه
Arthur-Merlin Games in Boolean Decision Trees
It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones Motivated by a question if randomization can signiicantly speed up a nondeterministic computation via a boolean decision tree, we address structural properties of Arthur-Merlin games in this model and prove some lower bounds. We consider two cases of interest, the rst when the length ...
متن کاملOn Higher Arthur-Merlin Classes
We study higher Arthur-Merlin classes de ned via several natural probabilistic operators BP;R and co-R. We investigate the complexity classes they de ne, and a number of interactions between these operators and the standard polynomial time hierarchy. We prove a hierarchy theorem for these higher Arthur-Merlin classes involving interleaving operators, and a theorem giving non-trivial upper bound...
متن کاملA short note on Merlin-Arthur protocols for subset sum
In complexity theory, a proof system as above is commonly referred to as a Merlin-Arthur protocol. These protocols very recently received attention [6, 3] in the exponential time setting: Williams [6] gives very generic Merlin-Arthur protocols with verifiers more efficient than best known exponential time algorithms. By no means we claim this note is innovative in any way: both our work and [6]...
متن کاملDerandomizing Arthur-Merlin Games
We establish hardness versus randomness trade-oos for Arthur-Merlin games. We create eecient nondeterministic simulations of bounded round Arthur-Merlin games, using a language in exponential time which small circuits cannot decide given access to an oracle for satissability. Our results yield subexponential size proofs for graph nonisomorphism at innnitely many lengths unless the polynomial-ti...
متن کاملThe Two Queries Assumption and Arthur-Merlin Classes
We explore the implications of the two queries assumption, P [1] = P SAT [2] || , with respect to the polynomial hierarchy (PH) and Arthur-Merlin classes. We prove the following results under the assumption P [1] = P SAT [2] || : 1. AM = MA 2. There exists no relativizable proof for PH ⊆ MA 3. Every problem in PH can be solved by a non-uniform variant of a Merlin-Arthur(MA) protocol where Arthu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 20 شماره
صفحات -
تاریخ انتشار 2013